Towards Unimodular Transformations for Non-perfectly Nested Loops

نویسنده

  • Peter M.W. Knijnenburg
چکیده

In this paper we discuss a possibility to extend unimodular transformations to non-perfectly nested loops. The main idea behind this extension is to convert a non-perfectly nested loop into a perfectly nested one by moving code into to innermost loop and properly guarding it to avoid multiple execution. This form of the loop can be viewed as an intermediate form for the transformation. Having obtained a perfectly nested loop, unimodular transformations can be applied in the usual way. The result of this transformation still contains guards. We show how to eliminate these guards. We illustrate our technique by transforming the ijk-version of LU-decomposition to the ikj-version.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Affine-by-Statement Transformations of Imperfectly Nested Loops

A majority of loop restructuring techniques developed so far assume that loops are perfectly nested. The unimodular approach unifies three individual transformations – loop interchange, skewing and reversal – but is still limited to perfect loop nests. This paper outlines a framework that enables the use of unimodular transformations to restructure imperfect loop nests. The concepts previously ...

متن کامل

Unimodular Transformations of Non-Perfectly Nested Loops

A framework is described in which a class of imperfectly nested loops can be restructured using unimodular transformations. In this framework, an imperfect loop nest is converted to a perfect loop nest using Abu-Sufah's Non-Basic-to-Basic-Loop transformation. Conditions for the legality of this transformation and techniques for their veriication are discussed. An iteration space, which extends ...

متن کامل

Locality Enhancement of Imperfectly Nested Loop Nests

Most numerical applications using arrays require extensive program transformation in order to perform well on current machine architectures with deep memory hierarchies. These transformations ensure that an execution of the application exploits data-locality a n d uses the caches more eeectively. The problem of exploiting data-locality i s w ell understood only for a small class of applications...

متن کامل

Non - unimodular Transformations of Nested

This paper presents a linear algebraic approach to modeling loop transformations. The approach uniies apparently unrelated recent developments in super-compiler technology. Speciically we show the relationship between the dependence abstraction called dependence cones, and fully permutable loop nests. Compound transformations are modeled as matrices. Non-singular linear transformations presente...

متن کامل

Improving Memory Hierarchy Performance through Combined Loop Interchange and Multi-Level Fusion

Because of the increasing gap between the speeds of processors and main memories, compilers must enhance the locality of applications to achieve high performance. Loop fusion enhances locality by fusing loops that access similar sets of data. Typically, it is applied to loops at the same level after loop interchange, which first attains the best nesting order for each local loop nest. However, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015